Quadtrees and Hypercubes: Grid Embedding Strategies Based on Spatial Data Structure Addressing
نویسندگان
چکیده
منابع مشابه
A Lower Bound on Embedding Large Hypercubes into Small Hypercubes
The problem of embedding an N -processor architecture G into an M -processor architecture H for N > M arises when algorithms designed for architectures of an ideal size are simulated on existing architectures which are of a xed size. In this paper we present solutions to this embedding problem for the case when both architectures are hypercubes and the embeddings are to achieve a balanced load....
متن کاملEmbedding hyperpyramids into hypercubes
A &k, d ) hyperpyramid is a level structure of k hypercubes, where the hypercube at level i is of dimension id, and a node at level i 1 is connected to every node in a &dimensional subcube at level i, except for the leaf level k. Hyperpyramids contain pyramids as propy subgraphs. We show that a hyperpyramid P(k, d ) can be embedded in a hypercube with minimal expansion and dilation = d. The con...
متن کاملEffects of Directional Subdividing on adaptive Grid-Embedding (RESEARCH NOTE)
The effects of using both directions and directional subdividing on adaptive gridembedding on the computational time and the number of grid points required for the same accuracy are considered. Directional subdividing is used from the beginning of the adaptation procedure without any restriction. To avoid the complication of unstructured grid, the semi-structured grid was used. It is used to so...
متن کاملTopQT: A Topological Data-Structure for Quadtrees
In this paper we propose a topological data structure for quadtrees, TopQT. This data structure is somewhat different from others very common in cell-complexes representations such as the famous half-edge. In the main result of this paper, we show that given a cell in the quadtree, TopQT is able to find all four connected neighbor cells in constant time. We give some pseudo algorithms to explai...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1993
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/36.6.562